Verifying Safety Properties of a PowerPC 1 Microprocessor Using Symbolic Model Checking without BDDs

نویسنده

  • A. Biere
چکیده

In [2] Bounded Model Checking with the aid of satis ability solving (SAT) was introduced as an alternative to traditional symbolic model checking based on solving xpoint equations with BDDs. In this paper we show how bounded model checking can take advantage of specialized optimizations. We present a bounded version of the cone of in uence reduction that works very well for verifying safety properties. We have successfully applied this idea to checking safety properties of a PowerPC microprocessor under design at Motorola's Somerset PowerPC design center. Based on that experience, we propose a veri cation methodology that we feel can bring model checking into the mainstream of industrial chip design.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Verifying Safety Properties of a Powerpc Tm ? Microprocessor Using Symbolic Model Checking without Bdds ??

In 1] Bounded Model Checking with the aid of satissability solving (SAT) was introduced as an alternative to symbolic model checking with BDDs. In this paper we show how bounded model checking can take advantage of specialized optimizations. We present a bounded version of the cone of innuence reduction. We have successfully applied this idea in checking safety properties of a PowerPC microproc...

متن کامل

Verifiying Safety Properties of a Power PC Microprocessor Using Symbolic Model Checking without BDDs

In [1] Bounded Model Checking with the aid of satisfiability solving (SAT) was introduced as an alternative to symbolic model checking with BDDs. In this paper we show how bounded model checking can take advantage of specialized optimizations. We present a bounded version of the cone of influence reduction. We have successfully applied this idea in checking safety properties of a PowerPC microp...

متن کامل

Combining Partial Order Reduction with Bounded Model Checking

Model checking is an efficient technique for verifying properties on reactive systems. Partial-order reduction (POR) and symbolic model checking are two common approaches to deal with the state space explosion problem in model checking. Traditionally, symbolic model checking uses BDDs which can suffer from space blowup. More recently bounded model checking (BMC) using SAT-based procedures has b...

متن کامل

Automatic Generation of Assertions for Formal Veri cation of PowerPC Microprocessor Arrays Using Symbolic Trajectory Evaluation

For verifying complex sequential blocks such as microprocessor embedded arrays, the formal method of symbolic trajectory evaluation (STE) has achieved great success in the past [[3], [5], [6]]. Past STE methodology for arrays requires manual creation of \assertions" to which both the RTL view and the actual design should be equivalent. In this paper, we describe a novel method to automate the a...

متن کامل

On the size of data structures used in symbolic model checking

Temporal Logic Model Checking is a verification method in which we describe a system, the model, and then we verify whether some properties, expressed in a temporal logic formula, hold in the system. It has many industrial applications. In order to improve performance, some tools allow preprocessing of the model, verifying on-line a set of properties reusing the same compiled model; we prove th...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 1999